A Modified Binary Pigeon-Inspired Algorithm for Solving the Multi-dimensional Knapsack Problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولAPPROXIMATE ALGORITHM FOR THE MULTI-DIMENSIONAL KNAPSACK PROBLEM BY USING MULTIPLE CRITERIA DECISION MAKING
In this paper, an interesting and easy method to solve the multi-dimensional knapsack problem is presented. Although it belongs to the combinatorial optimization, but the proposed method belongs to the decision making field in mathematics. In order to, initially efficiency values for every item is calculated then items are ranked by using Multiple Criteria Decision Making (MCDA). Finally, ite...
متن کاملSolving a bi-objective project capital budgeting problem using a fuzzy multi-dimensional knapsack
In this paper, the researchers have proposed a multi-dimensional knapsack model for project capital budgeting problem in uncertain situation which has been modeled through fuzzy sets. The optimistic and pessimistic situations were considered and associated deterministic models were yielded. Numerical example has been supplied toillustrate the performance of proposed model. The results were prom...
متن کاملsolving a bi-objective project capital budgeting problem using a fuzzy multi-dimensional knapsack
in this paper, the researchers have proposed a multi-dimensional knapsack model for project capital budgeting problem in uncertain situation which has been modeled through fuzzy sets. the optimistic and pessimistic situations were considered and associated deterministic models were yielded. numerical example has been supplied toillustrate the performance of proposed model. the results were prom...
متن کاملSolving A Multi-Dimensional Knapsack Problem Using A Hybrid Particle Swarm Optimization Algorithm
In this paper, an optimisation technique based on the Particle Swarm Optimization (PSO) algorithm will be experimented upon the Multi-dimensional Knapsack Problem. Through the merging of fundamental concepts of the existing PSO algorithm and selected features of evolutionary algorithms, a novel hybrid algorithm is created. When testing the algorithm against a test suite publicly available on OR...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Intelligent Systems
سال: 2020
ISSN: 2191-026X
DOI: 10.1515/jisys-2018-0450